Rings of Low Multiplicative Complexity and Fast Multiplication in Finite Fields
نویسندگان
چکیده
We survey the rings of low multiplicative complexity and the redundant representation of finite fields. The construction is originally due to Ito and Tsujii [3]. We give the important results of Silverman’s works in [1], [2]. Moreover, we note that the fields constructed with Silverman’s method are not suitable for elliptic curve cryptography while Silverman suggests those curves can be used in elliptic curve cryptography.
منابع مشابه
Efficient implementation of low time complexity and pipelined bit-parallel polynomial basis multiplier over binary finite fields
This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...
متن کاملSTRONGLY DUO AND CO-MULTIPLICATION MODULES
Let R be a commutative ring. An R-module M is called co-multiplication provided that foreach submodule N of M there exists an ideal I of R such that N = (0 : I). In this paper weshow that co-multiplication modules are a generalization of strongly duo modules. Uniserialmodules of finite length and hence valuation Artinian rings are some distinguished classes ofco-multiplication rings. In additio...
متن کاملDIFFERENTIAL MULTIPLICATIVE HYPERRINGS
There are several kinds of hyperrings, for example, Krasnerhyperrings, multiplicative hyperring, general hyperrings and$H_v$-rings. In a multiplicative hyperring, the multiplication isa hyperoperation, while the addition is a binary operation. In this paper, the notion of derivation on multiplicative hyperrings is introduced and some related properties are investigated. {bf Keywords:} multiplic...
متن کاملFinite Field Arithmetic Architecture Based on Cellular Array
Finite field arithmetic operations, especially for the binary field GF(2 m ), have been widely used in the areas of data communication and network security applications such as errorcorrecting codes [1,2] and cryptosystems such as ECC(Elliptic Curve Cryptosystem) [3,4]. The finite field multiplication is the most frequently studied. This is because the timeconsuming operations such as exponenti...
متن کاملAlgebraic complexities and algebraic curves over finite fields
We consider the problem of minimal (multiplicative) complexity of polynomial multiplication and multiplication in finite extensions of fields. For infinite fields minimal complexities are known [Winograd, S. (1977) Math. Syst. Theory 10, 169-180]. We prove lower and upper bounds on minimal complexities over finite fields, both linear in the number of inputs, using the relationship with linear c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012